Lengths are coordinates for convex structures
نویسندگان
چکیده
منابع مشابه
Lengths are coordinates for convex structures
Suppose that N is a geometrically finite hyperbolic 3-manifold such that the bending locus of its convex core is a collection of simple closed curves α. We prove that the map which associates to each structure the lengths of the curves in the bending locus is a global diffeomorphism from the set of all structures bent along α onto its image. If α is maximal, the traces of the curves αi ∈ α are ...
متن کاملBarycentric coordinates for convex sets
In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates over convex 2D polygons have found numerous applications in various fields as it allows smooth interpolation of data located on vertices. However, no explicit formulation valid for arbitrary convex polytopes has been proposed to extend this interpolation in higher di...
متن کاملBarycentric coordinates for convex polytopes
An extension of the standard barycentric coordinate functions for simplices to arbitrary convex polytopes is described. The key to this extension is the construction, for a given convex polytope, of a unique polynomial associated with that polytope. This polynomial, the adjoint of the polytope, generalizes a previous two-dimensional construction described by Wachspress. The barycentric coordina...
متن کاملCombinatorial Penalties: Which structures are preserved by convex relaxations?
We consider the homogeneous and the non-homogeneous convex relaxations for combinatorial penalty functions defined on support sets. Our study identifies key differences in the tightness of the resulting relaxations through the notion of the lower combinatorial envelope of a set-function along with new necessary conditions for support identification. We then propose a general adaptive estimator ...
متن کاملStructural Cues in 2D Tracking: Edge Lengths vs. Barycentric Coordinates
Graph models offer high representational power and useful structural cues. Unfortunately, tracking objects by matching graphs over time is in general NP-hard. Simple appearance-based trackers are able to find temporal correspondences fast and efficient, but often fail to overcome challenging situations like occlusions, distractors and noise. This paper proposes an approach, where an attributed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Geometry
سال: 2006
ISSN: 0022-040X
DOI: 10.4310/jdg/1146680513